Reduction of the search space to find perfect play of 6×6 board Othello
نویسندگان
چکیده
In 1993, mathematician Feinstein found out perfect play on 6×6 board Othello gives 16-20 loss for the first player by using computer. He reported on the Web that it took two weeks to search forty billion positions in order to obtain the result. In our previous papers, we confirmed the perfect play he found is correct. And we also found another perfect play different from the one he found to search 884 billion positions. In order to search efficiently, we attempted to reduce the search space to find some perfect play. In this paper, we introduce some techniques to solve 6×6 board Othello by searching about nine billion positions.
منابع مشابه
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author’s Othello program LOGISTELLO, which dominated the computer Othello scene for several years and won against the human World-champion 6–0 in 1997. First, a generalized linear evaluation model (GLEM) is described that combines conjunctions of Boolean features linearly. This approach allows an aut...
متن کاملModified Harmony Search Algorithm Based Unit Commitment with Plug-in Hybrid Electric Vehicles
Plug-in Hybrid Electric Vehicles (PHEV) technology shows great interest in the recent scientificliteratures. Vehicle-to-grid (V2G) is a interconnection of energy storage of PHEVs and grid. Byimplementation of V2G dependencies of the power system on small expensive conventional units canbe reduced, resulting in reduced operational cost. This paper represents an intelligent unitcommitment (UC) wi...
متن کاملModernity and “Monstros/city” in Othello and Nassirian’s Halu
The so-called “third world” has often experienced modernity and its version of the “city” in some of their most grotesque forms where Iran has not been an exception. In other words, North-Atlantic powers have historically played the midwife for a father-figure-like modernity and its “third world” concubines, the result of which has been the birth of “monstrosities” of all kinds. Focusing mainly...
متن کاملMachine Learning of Othello Heuristics
The machine learning algorithm of [3] is applied to the problem of learning which heuristics to apply when playing the board game Othello. The problem is large, for there are 46,875 heuristics considered. The results are respectable; the Learner is able to beat a practiced human player approximately fifty percent of the time. Suggestions for improvement are included.
متن کاملLearning to Play Othello with Deep Neural Networks
Achieving superhuman playing level by AlphaGo corroborated the capabilities of convolutional neural architectures (CNNs) for capturing complex spatial patterns. This result was to a great extent due to several analogies between Go board states and 2D images CNNs have been designed for, in particular translational invariance and a relatively large board. In this paper, we verify whether CNN-base...
متن کامل